Wireless charging is an important issue in wireless sensor networks, since it can provide\nan emerging and effective solution in the absence of other power supplies. The state-of-the-art\nmethods employ a mobile car and a predefined moving path to charge the sensor nodes in the\nnetwork. Previous studies only consider a factor of the network (i.e., residual energy of sensor\nnode) as a constraint to design the wireless charging strategy. However, other factors, such as the\ntravelled distance of the mobile car, can also affect the effectiveness of wireless charging strategy.\nIn this work, we study wireless charging strategy based on the analysis of a combination of two\nfactors, including the residual energy of sensor nodes and the travelled distance of the charging car.\nFirstly, we theoretically analyze the limited size of the sensor network to match the capability of\na charging car. Then, the networked factors are selected as the weights of traveling salesman problem\n(TSP) to design the moving path of the charging car. Thirdly, the charging time of each sensor node\nis computed based on the linear programming problem for the charging car. Finally, a charging\nperiod for the network is studied. The experimental results show that the proposed approach can\nsignificantly maximize the lifetime of the wireless sensor network.
Loading....